A method for computing the edge-hyper-Wiener index of partial cubes and an algorithm for benzenoid systems
نویسندگان
چکیده
منابع مشابه
An Algorithm for the Calculation of the Hyper-Wiener Index of Benzenoid Hydrocarbons
An algorithm for the calculation of the hyper-Wiener index (WW) of benzenoid hydrocarbons (both cata- and pericondensed) is described, based on the consideration of pairs of elementary cuts of the corresponding benzenoid graph B. A pair of elementary cuts partitions the vertices of B into four classes. WW is expressed as a sum of terms of the form n11n22 + n12n21, each associated with a pair of...
متن کاملCalculating the hyper–Wiener index of benzenoid hydrocarbons
A method for the calculation of the hyper–Wiener index (WW ) of a benzenoid system B is described, based on its elementary cuts. A pair of elementary cuts partitions the vertices of B into four fragments, possessing nrs , r, s = 1, 2 vertices. WW is equal to the sum of terms of the form n11 n22 + n12 n21 . The applicability of the method is illustrated by deducing a general expression for WW of...
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملComputing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2018
ISSN: 1452-8630,2406-100X
DOI: 10.2298/aadm1801126t